//
// Created by ct on 2021/11/3.
//

#include "btree.h"

/*
    auto root = btree::creat_tree();
    std::cout <<"test root is not nullptr:  " <<root->left->left->right->left->val <<std::endl;
    auto vc = btree::per_order(root);
    for (auto n : vc) {
        std::cout <<  n << " " ;
    }
    std::cout<<std::endl;
    auto vc1 = btree::in_order(root);
    for (auto n : vc1) {
        std::cout <<  n << " " ;
    }
    std::cout<<std::endl;

    auto vc2 = btree::post_order(root);
    for (auto n : vc2) {
        std::cout <<  n << " " ;
    }
    std::cout<<std::endl;

    vector<int> vc3;
    btree::per_order_witch(root,vc3);
    for (auto n : vc3) {
        std::cout <<  n << " " ;
    }
    std::cout<<std::endl;
 */